منابع مشابه
Walking Straight into Circles
Common belief has it that people who get lost in unfamiliar terrain often end up walking in circles. Although uncorroborated by empirical data, this belief has widely permeated popular culture. Here, we tested the ability of humans to walk on a straight course through unfamiliar terrain in two different environments: a large forest area and the Sahara desert. Walking trajectories of several hou...
متن کاملArbitrary decompositions into open and closed trails
The problem of arbitrary decomposition of a graph G into closed trails i.e. a decomposition into closed trails of prescribed lengths summing up to the size of the graph G was first considered in the case of the complete graph G = Kn (for odd n) in connection with vertexdistinguishing coloring of the union of cycles. Next, the same problem was investigated for other families of graphs. In this p...
متن کاملPacking closed trails into dense graphs
It has been shown [Balister, 2001] that if n is odd and m1, . . . , mt are integers with mi ≥ 3 and ∑t i=1 mi = |E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m1, . . . , mt. Here we show that the corresponding result is also true for any sufficiently large and sufficiently dense even graph G.
متن کاملEvolution of Dust Trails into Bands
We use numerical simulations to investigate the production of dust trails by asteroid disruption events. Our work shows that asteroid trails evolve into pairs of dust bands over time. Coherent trails typically survive several tens of kyr before evolving into complete bands after 1Myr. The transition timescale depends sensitively on the location of the source breakup event in the main asteroid b...
متن کاملAlmost quadratic gap between partition complexity and query/communication complexity
We show nearly quadratic separations between two pairs of complexity measures: • We show that there is a Boolean function f with D(f) = Ω((Dsc(f))2−o(1)) where D(f) is the deterministic query complexity of f and D is the subcube partition complexity of f ; • As a consequence, we obtain that there is f(x, y) such that D(f) = Ω(log2−o(1) χ(f)) where D(f) is the deterministic 2-party communication...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.06.027